ON LUCAS v-TRIANGLES
نویسنده
چکیده
are well known. A list of such basic identities can be found in [3]. If A ^ ±1 or B ^ 1, then w1? s^,... are nonzero by [1], and so are vx = u2lul9 v2 = M4/M2, ... . In the case A = B 1, we noted in [1] that un = 0 o 31n. IF vw = 0, then uln = i/wvw = 0; hence, 31n and un = Q, which is impossible since v~Au = 4B (cf. [3]). Thus, v0,v1? v2,... are all nonzero. We set vw! = Ilo ^ regard an empty product as value 1. For n,k eN with n>k,wt define the Lucas v-triangle {£} as follows:
منابع مشابه
On Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملNumerical Triangles and Several Classical Sequences
In 1991 Ferri, Faccio and D’Amico introduced and investigated two numerical triangles, called the DFF and DFFz triangles. Later Trzaska also considered the DFF triangle. And in 1994 Jeannin generalized the two triangles. In this paper, we focus our attention on the generalized Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal and Jacobsthal-Lucas polynomials, and several numerical triangles deduce...
متن کاملGeneralized Stirling Numbers and Hyper-Sums of Powers of Binomials Coefficients
We work with a generalization of Stirling numbers of the second kind related to the boson normal ordering problem (P. Blasiak et al.). We show that these numbers appear as part of the coefficients of expressions in which certain sequences of products of binomials, together with their partial sums, are written as linear combinations of some other binomials. We show that the number arrays formed ...
متن کاملar X iv : 0 90 1 . 25 97 v 1 [ m at h . R A ] 1 9 Ja n 20 09 GENERALIZED PASCAL TRIANGLES AND TÖEPLITZ MATRICES ∗
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a Töeplitz matrix and a unipotent upper triangular matrix. The determinant of a generalized Pascal matrix equals thus the determinant of a Töeplitz matrix. This equa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999